Partial Third-Party Information Exchange with Network Coding
نویسندگان
چکیده
منابع مشابه
Exchanging Third-Party Information in a Network
We consider the problem of exchanging information in a network, where every node can communicate with every other node through a common channel. In our model, every node wishes to exchange some local information (perhaps about a third party) with every other node in the network through the common channel. We provide the rate region for this fully connected network. The rate region we compute ca...
متن کاملFair Exchange with a Semi-Trusted Third Party
We present new protocols for two parties to exchange documents with fairness, i.e., such that no party can gain an advantage by quitting prematurely or otherwise misbehaving. We use a third party that is L‘semi-trusted”, in the sense that it may misbehave on its own but will not conspire with either of the main parties. In our solutions, disruption by any one of the three parties will not allow...
متن کاملTopology of dynamic metadata exchange via a trusted third party
Federated Identity Management is an effective technology that allows multiple organizations to share resources. Deployments of the protocol Security Assertion Markup Language (SAML) practically require the pre-exchange of aggregated metadata files, making federations to fixed trust boundaries. Dynamic metadata exchange between identity provider and service provider via a trusted third party (TT...
متن کاملFair Exchange of Short Signatures without Trusted Third Party
We propose a protocol to exchange Boneh-Boyen short signatures in a fair way, without relying on a trusted third party. Our protocol is quite practical and is the first of the sort to the best of our knowledge. Our construction uses a new non-interactive zero-knowledge (NIZK) argument to prove that a commitment is the encryption of a bit vector. We also design a NIZK argument to prove that a co...
متن کاملDirty Paper Coding with Partial State Information
A generalization of the problem of dirty paper coding is considered in which (possibly different) noisy versions of the state information, assumed to be i.i.d. Gaussian random variables, are available at the encoder and at the decoder. This paper derives the maximum achievable rate formula for this general problem. This general setup encompasses the cases where the state information is perfectl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2013
ISSN: 1089-7798
DOI: 10.1109/lcomm.2013.022213.130156